Difficulty Rating of Sokoban Puzzle

نویسندگان

  • Petr Jarusek
  • Radek Pelánek
چکیده

Sokoban puzzle is very challenging problem for both humans and computers. It also illustrates differences between human and artificial intelligence – different problems are difficult for humans and for computers. Whereas algorithmic techniques for Sokoban solving have been intensively studied by previous research, factors determining difficulty for humans have not been sufficiently explained so far. We describe two methods for difficulty rating of Sokoban puzzle – a problem decomposition metric and a computational model which simulates human traversal of a state space. We evaluate these metrics on large scale data on human solving (2000 problems solved, 785 hour of problem solving activity).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Driven Sokoban Puzzle Generation with Monte Carlo Tree Search

In this work, we propose a Monte Carlo Tree Search (MCTS) based approach to procedurally generate Sokoban puzzles. Our method generates puzzles through simulated game play, guaranteeing solvability in all generated puzzles. We perform a user study to infer features that are efficient to compute and are highly correlated with expected puzzle difficulty. We combine several of these features into ...

متن کامل

Human Problem Solving: Sokoban Case Study

We describe a case study in human problem solving for a particular problem – a Sokoban puzzle. For the study we collected data using the Internet. In this way we were able to collect significantly larger data (2000 problems solved, 780 hours of problem solving activity) than in typical studies of human problem solving. Our analysis of collected data focuses on the issue of problem difficulty. W...

متن کامل

What Determines Difficulty of Transport Puzzles?

What determines difficulty of solving a problem? Although this question has been studied before, we found examples which show large differences in problem difficulty which are not explained by concepts identified in previous research. This differences are caused mainly by the structure of a problems’ state spaces and cannot be easily captured by static metrics like size of the state space or th...

متن کامل

Procedural Generation of Sokoban Levels

We describe an algorithm for the procedural generation of levels for the popular Japanese puzzle game Sokoban. The algorithm takes a few parameters and builds a random instance of the puzzle that is guaranteed to be solvable. Although our algorithm and its implementation runs in exponential time, we present experimental evidence that it is sufficiently fast for offline use on a current generati...

متن کامل

Sokoban: Reversed Solving

This article describes a new method for attempting to solve Sokoban puzzles by means of an efficient algorithm, a task which has proven to be extremely difficult because of both the huge search tree depth and the large branching factor. We present a way of solving Sokoban puzzles that, using several heuristics, starts from the final state of a puzzle, and from there works its way back to the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010